-
1 рекурсивные множества
Programming: recursive setsУниверсальный русско-английский словарь > рекурсивные множества
-
2 теория множеств
1. set theory2. theory of sets -
3 пересечение множеств
Русско-английский большой базовый словарь > пересечение множеств
-
4 пустое множество
1. null set2. empty setРусско-английский большой базовый словарь > пустое множество
-
5 равномощное множество
Русско-английский военно-политический словарь > равномощное множество
-
6 рекурсивные и рекурсивно перечислимые множества
Programming: recursive and recursively enumerable setsУниверсальный русско-английский словарь > рекурсивные и рекурсивно перечислимые множества
-
7 доверительное множество
Русско-английский большой базовый словарь > доверительное множество
-
8 креативное множество
Русско-английский большой базовый словарь > креативное множество
-
9 ограниченное множество
Русско-английский большой базовый словарь > ограниченное множество
-
10 упорядоченное множество
Русско-английский большой базовый словарь > упорядоченное множество
-
11 элемент множества
Русско-английский большой базовый словарь > элемент множества
-
12 креативное множество
-
13 направленное множество
-
14 несчетное множество
-
15 остаточное множество
-
16 продуктивное множество
-
17 размытое множество
-
18 разрывное множество
-
19 суслинское множество
-
20 счетное множество
- 1
- 2
См. также в других словарях:
Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… … Wikipedia
Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… … Wikipedia
Limiting recursive — In computability theory, the term limiting recursive (also limit recursive or limit computable) describes sets that are the limit of a sequence of computable sets. Definition A set S is limiting recursive if there is a total computable function g … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
Creative and productive sets — In computability theory, productive sets and creative sets are types of sets of natural numbers that have important applications in mathematical logic. They are a standard topic in mathematical logic textbooks such as Soare (1987) and Rogers… … Wikipedia
Magic Sets algorithm — Magic Sets is the name of a query transformation algorithm for processing recursive queries written in Datalog. References * Francois Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D Ullman. Magic sets and other strange ways to implement logic… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia